Evaluation of k-nearest neighbour classifier performance for heterogeneous data sets
نویسندگان
چکیده
منابع مشابه
An empirical analysis of the probabilistic K-nearest neighbour classifier
The probabilistic nearest neighbour (PNN) method for pattern recognition was introduced to overcome a number of perceived shortcomings of the nearest neighbour (NN) classifiers namely the lack of any probabilistic semantics when making predictions of class membership. In addition the NN method possesses no inherent principled framework for inferring the number of neighbours, K, nor indeed assoc...
متن کاملan evaluation of the performance of an advanced approach of the k-nearest neighbour in simulating the daily meteorological data
weather data generators (wgs) have been developed for an extension of time series of such weather variables as rainfall, temperature and relative humidity to provide better understanding of systems affected by climatic factors. different algorithms have been applied in these generators, broadly divided into parametric & non-parametric ones. in this study, the performance of non-parametric gener...
متن کاملk-Nearest Neighbour Classifiers
Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...
متن کاملEfficient Computation of k-Nearest Neighbour Graphs for Large High-Dimensional Data Sets on GPU Clusters
This paper presents an implementation of the brute-force exact k-Nearest Neighbor Graph (k-NNG) construction for ultra-large high-dimensional data cloud. The proposed method uses Graphics Processing Units (GPUs) and is scalable with multi-levels of parallelism (between nodes of a cluster, between different GPUs on a single node, and within a GPU). The method is applicable to homogeneous computi...
متن کاملAn efficient weighted nearest neighbour classifier using vertical data representation
The k-nearest neighbour (KNN) technique is a simple yet effective method for classification. In this paper, we propose an efficient weighted nearest neighbour classification algorithm, called PINE, using vertical data representation. A metric called HOBBit is used as the distance metric. The PINE algorithm applies a Gaussian podium function to set weights to different neighbours. We compare PIN...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SN Applied Sciences
سال: 2019
ISSN: 2523-3963,2523-3971
DOI: 10.1007/s42452-019-1356-9